Markov Bases for Decomposable Graphical Models
نویسندگان
چکیده
In this paper we show that primitive data swaps or moves are the only moves that have to be included in a Markov basis that links all the contingency tables having a set of fixed marginals when this set of marginals induce a decomposable independence graph. We give formulas that fully identify such Markov bases and show how to use these formulas to dynamically generate random moves.
منابع مشابه
Minimal and minimal invariant Markov bases of decomposable models for contingency tables
We study Markov bases of decomposable graphical models consisting of primitive moves (i.e. square-free moves of degree two) by determining the structure of fibers of sample size two. We show that the number of elements of fibers of sample size two are powers of two and we characterize primitive moves in Markov bases in terms of connected components of induced subgraphs of the independence graph...
متن کاملMarkov Bases of Conditional Independence Models for Permutations
The L-decomposable and the bi-decomposable models are two families of distributions on the set Sn of all permutations of the first n positive integers. Both of these models are characterized by collections of conditional independence relations. We first compute a Markov basis for the L-decomposable model, then give partial results about the Markov basis of the bi-decomposable model. Using these...
متن کاملMarkov bases of decomposable models for contingency tables
We study Markov bases of hierarchical models in general and those of decomposable models in particular for multiway contingency tables by determining the structure of fibers of sample size two. We prove that the number of elements of fibers of sample size two are powers of two and we characterize the primitive moves (i.e. square-free moves of degree two) of Markov bases in terms of connected co...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Fibers of sample size two of hierarchical models and Markov bases of decomposable models for contingency tables
We study Markov bases of hierarchical models in general and those of decomposable models in particular for multiway contingency tables by determining the structure of fibers of sample size two. We prove that the number of elements of fibers of sample size two are powers of two and we characterizes the primitive moves of Markov bases in terms of connected components of a certain graph defined fr...
متن کاملLearning Decomposable Models for Classification
In some situations graphical models are learned to be used for classification of one given variable. The standard learning algorithms usually do not take this background knowledge into account. In the case of Bayesian networks this knowledge is often incorporated by assuming that the target variable will have no parents. This leads to discovering potentially bigger Markov boundaries of the targ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003